Prof. Dr. Victor Selivanov

Profile

Academic positionFull Professor
Research fieldsTheoretical Computer Science,Fundamentals of Mathematics, Logics, Set Theory
KeywordsEntscheidbarkeit, Komplexität, Mathematische Logik, Automaten, Sprachen

Current contact address

CountryRussian Federation
CityNovosibirsk
InstitutionRussian Academy of Sciences
InstituteA.P. Ershov Institute of Informatics Systems, Laboratory of theoretical programming
Homepagehttp://www.iis.nsk.su

Host during sponsorship

Prof. Dr. Klaus Ambos-SpiesInstitut für Mathematik, Ruprecht-Karls-Universität Heidelberg, Heidelberg
Prof. Dr. Wolfgang ThomasInformatik 7 - Logik und Theorie diskreter Systeme, Rheinisch-Westfälische Technische Hochschule Aachen (RWTH), Aachen
Start of initial sponsorship01/04/1993

Programme(s)

1992Humboldt Research Fellowship Programme

Publications (partial selection)

2009Victor Selivanov: Hierarchies and reducibilities on regular languages related to modulo counting. In: RAIRO Theoretical Informatics and Applications, 2009, 95-132
2008Victor Selivanov: Fine hierarchy of regular aperiodic omega-languages. In: International Journal of Foundations of Computer Science, 2008, 649-675
2005Victor Selivanov, Klaus Wagner: A reducibility for the dot-depth hierarchy . In: Theoretical Computer Science, 2005, 448-472
2005Victor Selivanov: Some reducibilities on regular sets . In: Barry Cooper, Benedikt Loewe, Leen Torenvliet, Computability in Europe (Proc. of Int. Conf.), Lecture Notes in Computer Science, v. 3526.. Springer, 2005. 430-440
2004Victor Selivanov, Klaus Wagner: A reducibility for the dot-depth hierarchy.. In: J. Fiala, V. Kenbek, J. Kratochvil, Proc of Int. Conf. Mathematical Foundations of Computer Science-2004, Lecture Notes in Computer Science, v. 3153.. Springer Verlag, 2004. 783-793
2002Victor Selivanov: Precomplete numberings. In: V.D. Mazurov etc., Proceedings of International Conferences on Mathematical Logic honoring Yu.L. Ershov and A.I. Mal'tsev. Institute of Mathematics, 2002. 104-143
2002Victor Selivanov: Relating automata-theoretic hierarchies to complexity-theoretic hierarchies. In: Theoretical Informatics and Applications, 2002, 29-42
2001Victor Selivanov: A logical approach to decidability of hierarchies of regular star-free languages . In: A. Ferreira, H. Reichel, Lecture Notes in Computer Science, v. 2010. Springer, 2001. 539-550
1999Victor Selivanov: Refining the polynomial hierarchy. In: Algebra and Logic, 1999, 456-475
1996Victor Selivanov: Fine hierarchy and definability in the Lindenbaum algebra. In: Wilfried Hodges etc., Logic: from foundations to applications. European Logic Colloquium. Oxford Science Publications, 1996. 425-452
1996Victor Selivanov: On recursively enumerable structures . In: Annals of pure and applied logic , 1996, 243-258
1995Victor Selivanov: Fine hierarchies and Boolean terms. In: The Journal of Symbolic Logic, 1995, 289-317
1995Victor Selivanov: Fine hierarchy of regular omega-languages. In: P.D. Mosses, M. Nielsen, M.I. Schwarzbach, Lecture Notes in Computer Science, v. 915. Springer, 1995. 277-287
1994Victor Selivanov: Recursiveness of omega-operations. In: Mathematical Logic Quaterly, 1994, 204-206
1994Victor Selivanov: Two refinements of the polynomial hierarchy. In: P.Enjalbert, E.W. Mayr, K.W. Wagner, Lecture Notes in Computer Science, v. 775 . Springer, 1994. 439-448